The complexity of fuzzy EL under the Łukasiewicz T-norm
نویسندگان
چکیده
Fuzzy Description Logics (DLs) are are a family of knowledge representation formalisms designed to represent and reason about vague and imprecise knowledge that is inherent to many application domains. Previous work has shown that the complexity of reasoning in a fuzzy DL using finitely many truth degrees is usually not higher than that of the underlying classical DL. We show that this does not hold for fuzzy extensions of the light-weight DL EL, which is used in many biomedical ontologies, under the finitely valued Łukasiewicz semantics. More precisely, the complexity of reasoning increases from P to ExpTime, even if only one additional truth value is introduced. When adding complex role inclusions and inverse roles, the logic even becomes undecidable. Even more surprisingly, when considering the infinitely valued Łukasiewicz semantics, reasoning in fuzzy EL is undecidable.
منابع مشابه
Positive Subsumption in Fuzzy EL with General t-Norms
The Description Logic EL is used to formulate several large biomedical ontologies. Fuzzy extensions of EL can express the vagueness inherent in many biomedical concepts. We study the reasoning problem of deciding positive subsumption in fuzzy EL with semantics based on general t-norms. We show that the complexity of this problem depends on the specific t-norm chosen. More precisely, if the t-no...
متن کاملThe Complexity of Subsumption in Fuzzy EL
Fuzzy Description Logics (DLs) are used to represent and reason about vague and imprecise knowledge that is inherent to many application domains. It was recently shown that the complexity of reasoning in finitely valued fuzzy DLs is often not higher than that of the underlying classical DL. We show that this does not hold for fuzzy extensions of the light-weight DL EL, which is used in many bio...
متن کاملŁukasiewicz Fuzzy EL is Undecidable
Fuzzy Description Logics have been proposed as formalisms for representing and reasoning about imprecise knowledge by introducing intermediate truth degrees. Unfortunately, it has been shown that reasoning in these logics easily becomes undecidable, when infinitely many truth degrees are considered and conjunction is not idempotent. In this paper, we take those results to the extreme, and show ...
متن کاملOn Qualified Cardinality Restrictions in Fuzzy Description Logics under Łukasiewicz semantics
Fuzzy Description Logics have been proposed as a family of languages to describe vague or imprecise structured knowledge. This work deals with one of the less studied constructors, qualified cardinality restrictions, showing some counter-intuitive behaviours under Łukasiewicz semantics, and proposing a new semantics and the corresponding reasoning algorithm.
متن کاملTropical linear algebra with the Łukasiewicz T-norm
The max-Łukasiewicz semiring is defined as the unit interval [0, 1] equipped with the arithmetics “a + b” = max(a, b) and “ab” = max(0, a + b− 1). Linear algebra over this semiring can be developed in the usual way. We observe that any problem of the max-Łukasiewicz linear algebra can be equivalently formulated as a problem of the tropical (max-plus) linear algebra. Based on this equivalence, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Approx. Reasoning
دوره 91 شماره
صفحات -
تاریخ انتشار 2017